Approximate Bisimulation and Discretization of Hybrid CSP

نویسندگان

  • Gaogao Yan
  • Li Jiao
  • Yangjia Li
  • Shuling Wang
  • Naijun Zhan
چکیده

Hybrid Communicating Sequential Processes (HCSP) is a powerful formal modeling language for hybrid systems, which is an extension of CSP by introducing differential equations for modeling continuous evolution and interrupts for modeling interaction between continuous and discrete dynamics. In this paper, we investigate the semantic foundation for HCSP from an operational point of view by proposing the notion of approximate bisimulation, which provides an appropriate criterion to characterize the equivalence between HCSP processes with continuous and discrete behaviour. We give an algorithm to determine whether two HCSP processes are approximately bisimilar. In addition, based on which, we propose an approach on how to discretize HCSP, i.e., given an HCSP process A, we construct another HCSP process B which does not contain any continuous dynamics such that A and B are approximately bisimilar with given precisions. This provides a rigorous way to transform a verified control model to a correct program model, which fills the gap in the design of embedded systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Algebraic Model Checking III: Approximate Methods

We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semialgebraic hybrid systems, and demonstrate how they relate to and extend other existing techniques.

متن کامل

Symbolic Models for Retarded Jump-Diffusion Systems

In this paper, we provide for the first time an automated, correct-by-construction, controller synthesis scheme for a class of infinite dimensional stochastic hybrid systems, namely, hybrid stochastic retarded systems. First, we construct finite dimensional abstractions approximately bisimilar to original infinite dimensional stochastic systems having some stability property, namely, incrementa...

متن کامل

Approximate Bisimulation Equivalence and Variable Refinement

In this paper, we consider an operator for refinement of variables to be used in the design of hybrid system. Variables on a given level of abstraction are replaced by more complicated processes on a lower level just like the function are called in the program. Then we established the equivalence, bisimulation equivalence and approximate bisimulation equivalence which are by polynomial flow eve...

متن کامل

Approximate Bisimulation for Switching Delays in Incrementally Stable Switched Systems

Time delays pose an important challenge in networked control systems, which are now ubiquitous. Focusing on switched systems, we introduce a framework that provides an upper bound for errors caused by switching delays. Our framework is based on approximate bisimulation, a notion that has been previously utilized mainly for symbolic (discrete) abstraction of state spaces. Notable in our framewor...

متن کامل

A Computational Approach to Bisimulation of Hybrid Dynamical Systems

The problem of finding a finite state symbolic model which is bisimilar to a hybrid dynamical system (HDS) and has the minimum number of states is considered. The considered class of HDS allows for discrete-valued inputs that only affect the jumps (events) of the HDS. Representation of the HDS in the form of a transition system is revisited in comparison with prior works. An algorithm is propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016